Blind search algorithms do not use heaurstics, but only use the values of nodes that the search has visited. Examples of blind search algorithms include depth first search, breadth first search, iterative broadening, iterative deepening and branch and bound.
Used on Chap. 4: page 80